2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

Source URL: www.sigact.org

• Probabilistic complexity theory
• Theoretical computer science
• Morphisms
• Computational complexity theory
• PCP theorem
• Mathematical optimization
• Probabilistically checkable proof
• Combinatorica
• IP
• Algorithm
• Russell Impagliazzo
• Graph isomorphism

THE COMPLEXITY OF CLASSIFICATION PROBLEMS IN ERGODIC THEORY ALEXANDER S. KECHRIS AND ROBIN D. TUCKER-DROB The last two decades have seen the emergence of a theory of set theoretic complexity of classification problems in

Source URL: www.math.cmu.edu

TSP Art Craig S. Kaplan School of Computer Science University of Waterloo

Source URL: www.cgl.uwaterloo.ca

• Mathematics
• Computational complexity theory
• Discrete mathematics
• Image processing
• Operations research
• Travelling salesman problem
• Voronoi diagram
• Stippling
• Dither
• Halftone
• Ordered dithering
• Drawing

The Sample Complexity of Revenue Maximization Richard Cole ∗ Tim Roughgarden † Courant Institute

Source URL: theory.stanford.edu

• Mechanism design
• Auction theory
• Auctions
• Game theory
• Probability distributions
• Vickrey auction
• VickreyClarkeGroves auction
• Auction
• Virtual valuation
• Valuation
• Distribution
• Exponential distribution

The MASON HouseholdsWorld Model of Pastoral Nomad Societies Claudio Cioffi-Revilla1, J. Daniel Rogers2, and Maciek Latek 1 1 Center for Social Complexity and Department of Computational Social Science, MSN 6B2

Source URL: cs.gmu.edu

• Academia
• Simulation
• Complex systems theory
• Nomads
• Cultural anthropology
• Scientific modeling
• Operations research
• Systems science
• Social simulation
• Agent-based model
• Scientific modelling
• Hunter-gatherer

Amit Chakrabarti Curriculum Vitae April 2014 Associate Professor Department of Computer Science

Source URL: www.cs.dartmouth.edu

• Theoretical computer science
• Academia
• Computer science
• Computational complexity theory
• Algorithms
• Streaming algorithm
• Symposium on Discrete Algorithms
• Communication complexity
• Bernard Chazelle
• Machtey Award

Barriers to Near-Optimal Equilibria Tim Roughgarden Computer Science Department Stanford University Stanford, CA, USA Email:

Source URL: theory.stanford.edu

• Game theory
• Price of anarchy
• Approximation algorithm
• Mathematical optimization
• Epsilon-equilibrium
• Congestion game
• Optimization problem
• Computational complexity theory
• Nash equilibrium
• Mechanism design

Bio Sketch for Rod Downey What area of maths do you mostly work in? I work in the mathematics of computation, complexity theory, and algorithmic randomness. Tell us a bit more...

Source URL: www.mathsreach.org

SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

PDF Document

Source URL: www.gaus.biz

• Philosophy
• Metaphysics
• Complex systems theory
• Systems
• Friedrich Hayek
• Complex systems
• Economic model
• Social complexity
• Austrian School
• Emergence
• Complexity
• Economics